منابع مشابه
Non Uniform Random Walks
Given εi ∈ [0,1) for each 1 < i < n, a particle performs the following random walk on {1,2, . . . ,n}: If the particle is at n, it chooses a point uniformly at random (u.a.r.) from {1, . . . ,n− 1}. If the current position of the particle is m (1 < m < n), with probability εm it decides to go back, in which case it chooses a point u.a.r. from {m + 1, . . . ,n}. With probability 1− εm it decides...
متن کاملNon-uniform Random Variate Generation
This is a survey of the main methods in non-uniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and transformations are reviewed. We provide information on the expected time complexity of various algorithms, before addressing modern topics such as indirectly specified distributions, random processes, a...
متن کاملSubhypergraphs in Non-uniform Random Hypergraphs
In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable approach. We begin by defining a generalization of the binomial random graph model to hypergraphs and formalizing several definitions of subhypergraph. The b...
متن کاملSubgraphs in Non-uniform Random Hypergraphs
Myriad problems can be described in hypergraph terms. However, the theory and tools are not sufficiently developed to allow most problems to be tackled directly within this context. The main purpose of this paper is to increase the awareness of this important gap and to encourage the development of this formal theory, in conjunction with the consideration of concrete applications. As a starting...
متن کاملSimulation Generation Of Non - Uniform Random Numbers
Problem: Given a uniform random variable U, generate a random variable X having a prescribed distribution function F X) (⋅. We previously discussed the inversion method. While inversion is a very general method, it may be computationally expensive. In particular, computing 1 X F () − ⋅ may have to be implemented via a numerical root-finding method in many cases. Therefore, we will now describe ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Infection Control
سال: 1985
ISSN: 0195-9417,2327-9451
DOI: 10.1017/s0195941700062901